Synapse: A Scalable Protocol for Interconnecting Heterogeneous Overlay Networks

نویسندگان

  • Luigi Liquori
  • Cédric Tedeschi
  • Laurent Vanni
  • Francesco Bongiovanni
  • Vincenzo Ciancaglini
  • Bojan Marinkovic
چکیده

This paper presents Synapse, a scalable protocol for information retrieval over the inter-connection of heterogeneous overlay networks. Applications on top of Synapse see those intraoverlay networks as a unique inter-overlay network. Scalability in Synapse is achieved via co-located nodes, i.e. nodes that are part of multiple overlay networks at the same time. Co-located nodes, playing the role of neural synapses and connected to several overlay networks, give a much wider search area and provide alternative routing. Built-in primitives to deal with social networking give an incentive for cooperation between nodes. Results from simulation and experiments show that Synapse is scalable, with a communication and state cost scaling with the same complexity of the connected networks. Because of alternative routing, Synapse gives also a practical solution to network partitions. We precisely capture the behavior of key metrics measuring Synapse and present results from simulations as well as some live run experiments of a client prototype on the Grid’5000 platform. The client implements the Synapse protocol in the precise case of the inter-connection of many Chord overlay networks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Scalable Protocol for Content-Based Routing in Overlay Networks

In content networks, messages are routed on the basis of their content and the interests (subscriptions) of the message consumers. This form of routing offers an interesting alternative to unicast or multicast communication in looselycoupled distributed systems with large number of consumers, with diverse interests, wide geographical dispersion, and heterogeneous resources (e.g., CPU, bandwidth...

متن کامل

Scalable Protocol for Content-Based Routing in Overlay Networks

In content networks, messages are routed on the basis of their content and the interests (subscriptions) of the message consumers. This form of routing offers an interesting alternative to unicast or multicast communication in looselycoupled distributed systems with large number of consumers, with diverse interests, wide geographical dispersion, and heterogeneous resources (e.g., CPU, bandwidth...

متن کامل

An efficient non-repudiation billing protocol in heterogeneous 3G-WLAN networks

The wireless communication with delivering variety of services to users is growing rapidly in recent years. The third generation of cellular networks (3G), and local wireless networks (WLAN) are the two widely used technologies in wireless networks. 3G networks have the capability of covering a vast area; while, WLAN networks provide higher transmission rates with less coverage. Since the two n...

متن کامل

Interconnecting smart objects through an overlay networking architecture

Network characteristics in the Internet of Things (large scale networks, more dynamic and more heterogeneous) increase the complexity in the design and provision of advanced services, making the traditional approaches inefficient or even inappropriate. This paper focuses on the design of a novel and open overlay network architecture for the end-to-end interconnection of networked (physical or v...

متن کامل

Securing the Scalable Source Routing Protocol

The Scalable Source Routing (SSR) protocol combines overlay-like routing in a virtual network structure with source routing in the physical network to a single cross-layer architecture. Thereby, it can provide indirect routing in networks that lack a well-crafted structure. SSR is well suited for mobile ad hoc networks, sensor-actuator networks, and especially for mesh networks. Moreover, SSR d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010